Primal-dual algorithms for audio decomposition using mixed norms
نویسندگان
چکیده
We consider the problem of decomposing audio into components that have different time frequency characteristics. For this, we model the components using different transforms and mixed norms. While recent works concentrate on the synthesis prior formulation, we consider both the analysis and synthesis prior formulations. We derive algorithms for both formulations through a primal-dual framework. We also discuss how to modify the primal-dual algorithms in order to derive a simpler heuristic scheme.
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملPrimal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملBiorthogonal Multiwavelets on the Interval: Cubic Hermite Splines
Starting with Hermite cubic splines as the primal multigenerator, first a dual multigenerator onR is constructed that consists of continuous functions, has small support, and is exact of order 2. We then derive multiresolution sequences on the interval while retaining the polynomial exactness on the primal and dual sides. This guarantees moment conditions of the corresponding wavelets. The conc...
متن کاملA Decomposition Method for Large Scale MILPs, with Performance Guarantees and a Power System Application
Lagrangian duality in mixed integer optimization is a useful framework for problems decomposition and for producing tight lower bounds to the optimal objective, but in contrast to the convex counterpart, it is generally unable to produce optimal solutions directly. In fact, solutions recovered from the dual may be not only suboptimal, but even infeasible. In this paper we concentrate on large s...
متن کاملOn Alternative Decompositions and Distributed Algorithms for Network Utility Problems
Network utility maximization problems arise when the design of a data network is formulated as a whole by means of utility functions. Although fully centralized algorithms are theoretically possible, in practical networks it is desirable to obtain distributed algorithms of simple implementation. In the existing literature, this is typically achieved by means of the so-called dual decomposition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Signal, Image and Video Processing
دوره 8 شماره
صفحات -
تاریخ انتشار 2014